Starter Labelling of k-Windmill Graphs with Small Defects
نویسندگان
چکیده
منابع مشابه
On (Kq, k) Stable Graphs with Small k
A graph G is (Kq, k) stable if it contains a copy of Kq after deleting any subset of k vertices. In a previous paper we have characterized the (Kq, k) stable graphs with minimum size for 3 6 q 6 5 and we have proved that the only (Kq, k) stable graph with minimum size is Kq+k for q > 5 and k 6 3. We show that for q > 6 and k 6 q 2 + 1 the only (Kq, k) stable graph with minimum size is isomorphi...
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملk-Efficient partitions of graphs
A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...
متن کاملCharacterisation of Graphs with Exclusive Sum Labelling
A sum graph G is a graph with a mapping of the vertex set of G onto a set of positive integers S in such a way that two vertices of G are adjacent if and only if the sum of their labels is an element of S. In an exclusive sum graph the integers of S that are the sum of two other integers of S form a set of integers that label a collection of isolated vertices associated with the graph G. A grap...
متن کاملTotal Vertex Irregularity Strength of Circular Ladder and Windmill Graphs
Let ( , ) G V E be a simple graph. For a total labeling { } : 1,2,3,..., V E k ∂ ∪ → the weight of a vertex x is defined as ( ) ( ) ( ). xy E wt x x xy ∈ = ∂ + ∂ ∑ ∂ is called a vertex irregular total k-labeling if for every pair of distinct vertices x and y, ( ) ( ). wt x wt y ≠ . The minimum k for which the graph G has a vertex irregular total k-labeling is called the total vertex irregularit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Combinatorics
سال: 2015
ISSN: 1687-9163,1687-9171
DOI: 10.1155/2015/528083